queueing time
英 [ˈkjuːɪŋ taɪm]
美 [ˈkjuːɪŋ taɪm]
网络 排队时间
双语例句
- In any system where work is queuing up, the response time of the system is likely to be dominated by the queueing time, rather than any garbage collection pauses.
如果系统中存在正在排队等候的任务，那么系统的响应时间可能会受到排队时间的控制，而不是垃圾收集停顿时间。 - Please be understandable if you maybe stopped from queueing head of the close time of the attraction or the park in case of too many people.
另外，为了配合项目截止运行时间及公园闭园时间，依据等候时间的状况，有时会提前终止项目排队或入场，敬请谅解。 - The queue length distribution of M/ G/ 1/ ∞ repairable queueing system with delay repair time
修理有延迟的M/G/1/∞可修排队系统的队长分布 - Queueing Analysis and Mean Waiting Time of Asymmetric Multi-Token Ring System with Limited Services
限制式非对称多令牌环形系统的排队分析与平均等待时间 - The Discrete-time Queueing System with Repairable Server and Phase-type Repair Time
具有位相型修理的离散时间可修排队系统 - Transfer Delay and Queueing Time of RPR Network
弹性分组环分组排队时间及传输延时的研究 - Method of Analyzing Queueing Waiting Time of Sources with Heavy-Tailed Distribution
重尾分布信源的排队等待时间的分析方法 - This paper discusses the bounds of the waiting time distribution in M/ G/ 1 queueing system with multiple server vacations by some characters of service time distribution. And some useful bounds of the waiting time distribution are obtained.
本文根据服务时间分布的一些特殊性质，研究了多重休假M/G/1排队系统等待时间分布函数的界值问题，得到一些实用的、便于数值计算的界值结果，具有重要的应用价值。 - Queueing system with general operation and vacation time
有一般服务运作和休假时间的排队系统 - The Transient Theory of the GI/ G/ 1 Queueing System with Set-up Time
启动时间的GI/G/1排队系统的非平衡理论 - In this paper we study a discrete-time repairable queueing system with Markovian arrival process. Provided that the lifetime of server follows a geometric distribution, the service time and the repair time follow a discrete phase type distributions.
本文研究了具有马尔可夫到达过程的离散时间可修排队系统，假定服务台寿命服从几何分布，服务台对顾客的服务时间和服务台的修理时间均服从离散位相型（PH）分布。 - The paper discusses the repairable queueing system with a general arrival, where the lifetime of server and the service time are also exponential random variables, the repair time is PH variable.
本文首次讨论一个到达间隔为一般分布的可修排队系统。假定服务时间、忙期服务台寿命都服从指疏分布，修复时间是PH变量。 - By application of queueing theory this paper studies the real time problem of shipboard command and control system, a complex real time system.
本文用排队理论来研究舰载指控系统这样一个复杂的实时系统的实时性问题。 - In this paper, N-union station Fork-Join queueing network is studied detailed by means of probability measure weak convergence and strong approximation in probability. We obtain weak convergence and strong approximation theorems for response time.
本文借助于概率测度弱收敛与概率论强逼近理论，较为详细地研究了N台并联Fork-Join排队网络，得到了响应时间、队长、离去过程的弱收敛与强逼近定理。 - In the paper is introduced the rule of adaptive multistage vacation in the classical queueing system M/ G/ 1. Distributions and random decomposition results of queueing length and waiting time are deduced.
在经典M/G/1排队中引入多级适应性休假规则，得到稳态队长、等待时间分布和随机分解，并给出忙期、假期、在线期分布。 - With the constraint of resource quantity, resource is allocated to the procedure which decreases components 'average queueing time most significantly with the same resource quantity increment.
在资源数量约束下，依次让各工序资源数量增一，使零件在系统中平均排队时间减少最大的工序首先分配资源。 - Thus, with the combination of these two algorithms, performance of the MUPMA protocol in terms of the throughput and average packet queueing time can be evaluated.
基于这两种算法，可以估计MUPMA协议对应的平均分组等待时延和信道利用率。 - In reference, it is has introduced a kind of stochastic process Markov skeleton processes with wide prospects in applications in this paper we use this method to study the queueing lenth and the waiting time probability distribution of GI/ G/ 1 with single vacation.
文献[1]引入一类具有广泛应用前景的随机过程-Markov骨架过程，借助Markov骨架过程的方法研究GI/G/1单重休假服务系统队长，及t时刻到达顾客等待时间的瞬时概率分布。 - An algorithm of mean queueing time on each terminal and class for some polling network
一类轮询服务系统平均等待时间的算法 - An M/ M/ 1 queueing system with general operation and vacation time is considered.
考虑一个有一般服务运作和休假时间的M/M/1排队系统。 - This paper studies a queueing system wherein the distribution of the m-th interarrival time α_m-α_ ( m-1)( m ≥ 1) depends on the number of customers in the system at time α_ ( m-1).
探讨了一个有如下特征的排队系统：该系统的第m个到达间隔αm-αm-1（m≥1）的分布依赖系统在时刻αm-1拥有的顾客数目。 - The optimization object is to minimize components 'average queueing time in the system.
优化目标是零件在系统中平均排队时间最短。 - Secondly, priority queueing policy is analyzed and performance analysis is given, preemptive priority queuing model with traffic control is discussed based on this and performance analysis is given at the same time.
其次分析了优先排队策略，在此基础上讨论了带流量控制的强占优先排队模型，并给出了性能分析。 - For the first model, the stochastic decompositions of steady-state queueing length and steady-state waiting time are analyzed by introducing supplementary variable parameters, and busy period is discussed.
对第一类模型引入附加变量参数来分析系统的稳态队长和稳态等待时间的随机分解及忙期分析。 - The discrete-time MMAP [ K]/ PH [ K]/ 1 queueing system with reneging is discussed, where there is K types of the customers, patient time of different customers is a discrete random variable and follows differently general distribution.
讨论了带中途退出的离散时间MMAP[K]/PH[K]/1排队系统，其中系统含有K种类型的顾客，不同类型顾客的耐心时间服从不同的一般离散型分布。 - Then the performance measures of the systerm are analyzed respectively on the point of queueing theory and reliability, then the mean queue length, the availability, the mean time to first failure of the systerm and the reliability of laplace transform are derived.
然后分别从排队论角度和可靠性角度分析了系统的性能，得到了平均队长、可用度、首次故障前平均时间、可靠度的拉普拉斯变换等指标。